Enumerating Floorplans with Some Properties
نویسندگان
چکیده
منابع مشابه
Enumerating Floorplans with n Rooms
A plane drawing of a graph is called a floorplan if every face (including the outer face) is a rectangle. A based floorplan is a floorplan with a designated base line segment on the outer face. In this paper we give a simple algorithm to generate all based floorplans with at most n faces. The algorithm uses O(n) space and generates such floorplans in O(1) time per floorplan without duplications...
متن کاملEnumerating Labelled Graphs with Certain Neighborhood Properties
Properties of (connected) graphs whose closed or open neighborhood families are Sperner, anti-Sperner, distinct or none of the proceeding have been extensively examined. In this paper we examine 24 properties of the neighborhood family of a graph. We give asymptotic formulas for the number of (connected) labelled graphs for 12 of these properties. For the other 12 properties, we give bounds for...
متن کاملEnumerating Some Fractional Repetition Codes
In a distributed storage systems (DSS), regenerating codes are used to optimize bandwidth in the repair process of a failed node. To optimize other DSS parameters such as computation and disk I/O, Distributed Replication-based Simple Storage (Dress) Codes consisting of an inner Fractional Repetition (FR) code and an outer MDS code are commonly used. Thus constructing FR codes is an important re...
متن کاملSlicing Floorplans with Boundary Constraint
In oorplanning of VLSI design it is useful if users are allowed to specify some placement constraints in the pack ing One particular kind of placement constraints is to pack some modules on one of the four sides on the left on the right at the bottom or at the top of the nal oorplan These are called boundary constraints In this paper we enhanced a well known slicing oorplanner to handle these b...
متن کاملCoding Floorplans with Fewer Bits
In this paper we consider the problem of encoding a given floorplan R into a binary string S so that S can be decoded to reconstruct R. Furthermore we wish to minimize the length of S . Succinct representation of graphs are studied for many classes of graphs [14], for instance, trees [8], [15] and plane graphs [2], [3], [6], [11]. The well known naive coding of ordered trees is as follows. Give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2002
ISSN: 1347-6157,1340-9050
DOI: 10.4036/iis.2002.199